On prefix normal words and prefix normal forms
نویسندگان
چکیده
منابع مشابه
On prefix normal words and prefix normal forms
A 1-prefix normal word is a binary word with the property that no factor has more 1s than the prefix of the same length; a 0-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of 1s and 0s (a given Parikh vector). Each binary word has an associated set ...
متن کاملOn Combinatorial Generation of Prefix Normal Words
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal wor...
متن کاملNormal, Abby Normal, Prefix Normal
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number pnw(n) of prefix normal words of length n, showing that pnw(n) = Ω ( 2n−c √ n lnn ) for some c and pnw(n) = O ( 2(lnn) n ) . We introduce eff...
متن کاملBubble-Flip - A New Generation Algorithm for Prefix Normal Words
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings, which exploit certain properties of prefix normal words in a smart way. We introduce infinite prefix normal words and show that one of the operations used by ...
متن کاملPrefix Codes: Equiprobable Words, Unequal Letter Costs
We consider the following variant of Huffman coding in which the costs of the letters, rather than the probabilities of the words, are non-uniform: “Given an alphabet of r letters of nonuniform length, find a minimum-average-length prefix-free set of n codewords over the alphabet;” equivalently, “Find an optimal r-ary search tree with n leaves, where each leaf is accessed with equal probability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.10.015